Asymptotic properties of distributed social sampling algorithm
نویسندگان
چکیده
منابع مشابه
Sampling from social networks’s graph based on topological properties and bee colony algorithm
In recent years, the sampling problem in massive graphs of social networks has attracted much attention for fast analyzing a small and good sample instead of a huge network. Many algorithms have been proposed for sampling of social network’ graph. The purpose of these algorithms is to create a sample that is approximately similar to the original network’s graph in terms of properties such as de...
متن کاملAsymptotic properties of the sample mean in adaptive sequential sampling with multiple selection criteria
We extend the method of adaptive two-stage sequential sampling toinclude designs where there is more than one criteria is used indeciding on the allocation of additional sampling effort. Thesecriteria, or conditions, can be a measure of the targetpopulation, or a measure of some related population. We developMurthy estimator for the design that is unbiased estimators fort...
متن کاملasymptotic properties of the sample mean in adaptive sequential sampling with multiple selection criteria
we extend the method of adaptive two-stage sequential sampling toinclude designs where there is more than one criteria is used indeciding on the allocation of additional sampling effort. thesecriteria, or conditions, can be a measure of the targetpopulation, or a measure of some related population. we developmurthy estimator for the design that is unbiased estimators fort...
متن کاملAsymptotic Properties of One-Bit Distributed Detection with Ordered Transmissions
Consider a sensor network made of remote nodes connected to a common fusion center. In a recent work Blum and Sadler [1] propose the idea of ordered transmissions —sensors with more informative samples deliver their messages first— and prove that optimal detection performance can be achieved using only a subset of the total messages. Taking to one extreme this approach, we show that just a sing...
متن کاملAsymptotic properties of the algebraic constant modulus algorithm
The algebraic constant modulus algorithm (ACMA) is a noniterative blind source separation algorithm. It computes jointly beamforming vectors for all constant modulus sources as the solution of a joint diagonalization problem. In this paper, we analyze its asymptotic properties and show that (unlike CMA) it con verges to the Wiener beamformer when the number of samples or the signal-to-noise rat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2019
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-019-9890-5